Drawing some 4-regular planar graphs with integer edge lengths
نویسنده
چکیده
A classic result of Fáry states that every planar graph can be drawn in the plane without crossings using only straight line segments. Harborth et al. conjecture that every planar graph has such a drawing where every edge length is integral. Biedl proves that every planar graph of maximum degree 4 that is not 4-regular has such a straight-line embedding, but the techniques are insufficient for 4-regular graphs. We further develop the rigidity-theoretic methods of the author and examine an incomplete construction of Kemnitz and Harborth to exhibit integral drawings of families of 4-regular graphs.
منابع مشابه
Drawing some planar graphs with integer edge-lengths
In this paper, we study drawings of planar graphs such that all edge lengths are integers. It was known that such drawings exist for all planar graphs with maximum degree 3. We give a different proof of this result, which is based on a simple transformation of hexagonal drawings as created by Kant. Moreover, if the graph is 3-connected then the vertices have integer coordinates that are in O(n)...
متن کاملEdge-Weighted Contact Representations of Planar Graphs
We study contact representations of edge-weighted planar graphs, where vertices are rectangles or rectilinear polygons and edges are polygon contacts whose lengths represent the edge weights. We show that for any given edge-weighted planar graph whose outer face is a quadrangle, that is internally triangulated and that has no separating triangles we can construct in linear time an edge-proporti...
متن کاملRigidity-Theoretic Constructions of Integral Fary Embeddings
Fáry [3] proved that all planar graphs can be drawn in the plane using only straight line segments. Harborth et al. [7] ask whether or not there exists such a drawing where all edges have integer lengths, and Geelen et al. [4] proved that cubic planar graphs satisfied this conjecture. We re-prove their result using rigidity theory, exhibit other natural families of planar graphs that satisfy th...
متن کاملPlanar Octilinear Drawings with One Bend Per Edge
In octilinear drawings of planar graphs, every edge is drawn as an alternating sequence of horizontal, vertical and diagonal (45◦) line-segments. In this paper, we study octilinear drawings of low edge complexity, i.e., with few bends per edge. A k-planar graph is a planar graph in which each vertex has degree less or equal to k. In particular, we prove that every 4-planar graph admits a planar...
متن کاملOn a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segment without edge crossings. It is well known that a planar graph of n vertices admits a straight-line grid drawing on a grid of area O(n). A lower bound of Ω(n) on the area-requirement for straight-line grid drawings o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013